Probabilistic Analysis of Anonymity
نویسنده
چکیده
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of group members and the adversary is modeled as a discrete-time Markov chain, and security properties are expressed as PCTL formulas. To illustrate feasibility of the approach, we model the Crowds system for anonymous Web browsing, and use a probabilistic model checker, PRISM, to perform automated analysis of the system and verify anonymity guarantees it provides. The main result of the Crowds analysis is a demonstration of how certain forms of anonymity degrade with the increase in group size and the number of random routing paths.
منابع مشابه
Probabilistic Anonymity Via Coalgebraic Simulations
There is a growing concern about anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, the importance of probabilistic aspect of anonymity is claimed recently by many authors. Several different notions of “probabilistic anonymity” have been studied so far, but proof methods for such probabilistic notions are not yet elaborat...
متن کاملFormal Notions of Anonymity for Peer-to-peer Networks
Providing anonymity support for peer-to-peer (P2P) overlay networks is critical. Otherwise, potential privacy attacks (e.g., network address traceback) may deter a storage source from providing the needed data. In this paper we use this practical application scenario to verify our observation that network-based anonymity can be modeled as a complexity based cryptographic problem. We show that, ...
متن کاملThesis Proposal
Privacy and anonymity are essential to society in both the physical and the electronic domain. Anonymous police tips and witness protection programs are common in the physical realm. The Internet can provide an electronic medium for free expression, but not if users can be identified and censored by totalitarian governments. There have been many attempts to provide anonymous electronic communic...
متن کاملTrust in Crowds: Probabilistic Behaviour in Anonymity Protocols
The existing analysis of the Crowds anonymity protocol assumes that a participating member is either ‘honest’ or ‘corrupted’. This paper generalises this analysis so that each member is assumed to maliciously disclose the identity of other nodes with a probability determined by her vulnerability to corruption. Within this model, the trust in a principal is defined to be the probability that she...
متن کاملA Probabilistic Multicast with Universally Composable Anonymity in MANETs
Current anonymous routing protocols do not provide anonymous mechanism for multicast in MANETs and have only had ad-hoc anonymity analysis. This paper proposes a new scheme called probabilistic multicast with universally composable anonymity. One-Time key pair is used to keep a route record in privacy during route discovery processes. Gossip-Scheme, secret DH path and Bloom Filter are adopted t...
متن کامل